Editorial: Johann Amos Comenius

Johann Wolfgang

Dr Johann Willers

Workflow Recovery * Johann Eder

WorkJlow management systems ( WFMSs) more and more become the basic technology for organizations to pei$orm their daily business processes (workjlows). A consistent and reliable execution of such processes is crucial for all organizations. We claim that this can only be achieved by integrating transactional features especially “workjlow transactions” into WFMSs. Based on this idea, we discuss i...

Proof Labeling Schemes ∗ Amos Korman

This paper addresses the problem of locally verifying global properties. Several natural questions are studied, such as “how expensive is local verification?” and more specifically “how expensive is local verification compared to computation?” A suitable model is introduced in which these questions are studied in terms of the number of bits a node needs to communicate. In addition, approaches a...

Competitive Paging Algorithms AMOS FIAT

The paging problem is that of deciding which pages to keep in a memory of k pages in order to minimize the number of page faults. We develop the marking algorithm, a randomized on-line algorithm for the paging problem. We prove that its expected cost on any sequence of requests is within a factor of 2Hk of optimum. (Where Hk is the kth harmonic number, which is roughly Ink.) The best such facto...